Stochastic flow networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Flow Networks for Synthesizing Target Distributions

A stochastic flow network is a directed graph with incoming edges (inputs) and outgoing edges (outputs), tokens enter through the input edges, travel stochastically in the network and can exit the network through the output edges. Each node in the network is a splitter, namely, a token can enter a node through an incoming edge and exit on one of the output edges according to a predefined probab...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

Fuzzy completion time for alternative stochastic networks

In this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. In other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of network. Then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (TFN). This paper com...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

متن کامل

Path-additive Functions in Stochastic Flow Networks with Markovian Routing

1.1. Rationale The Jackson network [1] is a basic model favored as a useful beginning approach to many queueing network problems. Its appeal stems from not only its product-form solution for the joint distribution of the number of customers in each queue but also from the simplicity of the structures of the model. Markovian routing is one such structure. The purpose of this paper is to study so...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1987

ISSN: 0304-4149

DOI: 10.1016/0304-4149(87)90066-4